Generalized Quantifiers and 0-1 Laws
نویسندگان
چکیده
We study 0-1 laws for extensions of rst-order logic by Lindstrr om quantiiers. We state suucient conditions on a quantiier Q expressing a graph property, for the logic FOQ] { the extension of rst-order logic by means of the quantiier Q { to have a 0-1 law. We use these conditions to show, in particular, that FORig], where Rig is the quantiier expressing rigidity, has a 0-1 law. We also show that FOHam], where Ham is the quantiier expressing Hamiltonicity, does not have a 0-1 law. Blass and Harary pose the question whether there is a logic which is powerful enough to express Hamiltonicity or rigidity and which has a 0-1 law. It is a consequence of our results that there is no such regular logic (in the sense of abstract model theory) in the case of Hamiltonicity, but there is one in the case of rigidity. We also consider sequences of vectorized quantiiers, and show that the extensions of rst-order logic obtained by adding such sequences generated by quantiiers that are closed under substructures have 0-1 laws.
منابع مشابه
Properties of Almost All Graphs and Generalized Quantifiers
We study 0-1 laws for extensions of first-order logic by Lindström quantifiers. We state sufficient conditions on a quantifier Q expressing a graph property, for the logic FO[Q] – the extension of first-order logic by means of the quantifier Q – to have a 0-1 law. We use these conditions to show, in particular, that FO[Rig], where Rig is the quantifier expressing rigidity, has a 0-1 law. We als...
متن کاملGeneralized Non-deterministic Matrices and (n, k)-ary Quantifiers
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical Gentzen-type systems with (n, k)-ary quantifiers are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of an (n, k)-ary quantifier is introduced. The semantics of such systems for the case of k ∈ {0, 1}...
متن کاملCombinatorics and quantifiers
Let I m be the set of subsets of I of cardinality m. Let f be a coloring of I m and g a coloring of I m . We write f → g if every f -homogeneous H ⊆ I is also g-homogeneous. The least m such that f → g for some f : I m → k is called the kwidth of g and denoted by wk(g). In the first part of the paper we prove the existence of colorings with high k-width. In particular, we show that for each k >...
متن کاملMonadic L-fuzzy Quantifiers of the Type <1n,1>
The aim of this paper is to introduce monadic L-fuzzy quantifiers of the type 〈1, 1〉 and to investigate some of their semantic properties that are well-known in the generalized quantifier theory. Further, some relations between the semantic properties of generalized quantifiers are also studied for monadic L-fuzzy quantifiers. Finally, a property “to be extensional w.r.t. a given L-permutation ...
متن کاملPartially-Ordered (Branching) Generalized Quantifiers: A General Definition
Following Henkin’s discovery of partially-ordered (branching) quantification (POQ) with standard quantifiers in 1959, philosophers of language have attempted to extend his definition to POQ with generalized quantifiers. In this paper I propose a general definition of POQ with 1-place generalized quantifiers of the simplest kind: namely, predicative, or “cardinality” quantifiers, e.g., “most”, “...
متن کامل